翻訳と辞書
Words near each other
・ Random-access channel
・ Random-access machine
・ Random-access memory
・ Random-access stored-program machine
・ Random-access Turing machine
・ Random.org
・ Randomajestiq
・ Randominta
・ Randomization
・ Randomization function
・ Randomized algorithm
・ Randomized algorithms as zero-sum games
・ Randomized block design
・ Randomized controlled trial
・ Randomized experiment
Randomized Hough transform
・ Randomized meldable heap
・ Randomized response
・ Randomized rounding
・ Randomized weighted majority algorithm
・ Randomness
・ Randomness extractor
・ Randomness merger
・ Randomness tests
・ Random—Burin—St. George's
・ Randon
・ Randonnai
・ Randonneuring
・ Randonneurs USA
・ Randonnée


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Randomized Hough transform : ウィキペディア英語版
Randomized Hough transform
Hough transforms are techniques for object detection, a critical step in many implementations of computer vision, or data mining from images. Specifically, the Randomized Hough transform is a probabilistic variant to the classical Hough transform, and is commonly used to detect curves (straight line, circle, ellipse, etc.)〔D.H. Ballard, "Generalizing the Hough Transform to Detect Arbitrary Shapes", Pattern Recognition, Vol.13, No.2, p.111-122, 1981〕 The basic idea of Hough transform (HT) is to implement a voting procedure for all potential curves in the image, and at the termination of the algorithm, curves that do exist in the image will have relatively high voting scores. Randomized Hough transform (RHT) is different from HT in that it tries to avoid conducting the computationally expensive voting process for every nonzero pixel in the image by taking advantage of the geometric properties of analytical curves, and thus improve the time efficiency and reduce the storage requirement of the original algorithm.
==Motivation==
Although Hough transform (HT) has been widely used in curve detection, it has two major drawbacks:〔L. Xu, E. Oja, and P. Kultanan, "A new curve detection method: Randomized Hough transform (RHT)", ''Pattern Recog. Lett.'' 11, 1990, 331-338.〕 First, for each nonzero pixel in the image, the parameters for the existing curve and redundant ones are both accumulated during the voting procedure. Second, the accumulator array (or Hough space) is predefined in a heuristic way. The more accuracy needed, the higher parameter resolution should be defined. These two needs usually result in a large storage requirement and low speed for real applications. Therefore, RHT was brought up to tackle this problem.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Randomized Hough transform」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.